Temporal Extensions to Defeasible Logic

نویسندگان

  • Guido Governatori
  • Paolo Terenziani
چکیده

In this paper, we extend defeasible logic (a computationally-oriented non-monotonic logic) in order to deal with temporalised rules. In particular, we extend the logic to cope with durative facts, as well as with delays between the antecedent and the consequent of rules. We showed that the extended temporalised framework is suitable to model different types of causal relations which have been identified by the specialised literature. Finally, we also demonstrate that the computational properties of the original logic are still retained by the extended approach.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Complexity of Temporal Defeasible Logic

In this paper we investigate the complexity of temporal defeasible logic, and we propose an efficient algorithm to compute the extension of a temporalised defeasible theory. We motivate the logic showing how it can be used to model deadlines.

متن کامل

On the Equivalence of Defeasible Deontic Logic and Temporal Defeasible Logic

In this paper we formally prove that compliance results derived from temporal defeasible logic are equivalent to the ones obtained in the standard defeasible deontic logic. In order to do so we first introduce an operator allowing us to translate rules from the standard to the temporal framework. Then we consider the sets of obligations used in the compliance checking algorithm from [19] and pr...

متن کامل

Computing Temporal Defeasible Logic

We investigate the complexity of temporal defeasible logic, and propose an efficient algorithm to compute the extension of any theory. The logic and algorithm are discussed in regard to modeling deadlines and normative retroactivity.

متن کامل

The Making of SPINdle

We present the design and implementation of SPINdle – an open source Java based defeasible logic reasoner capable to perform efficient and scalable reasoning on defeasible logic theories (including theories with over 1 million rules). The implementation covers both the standard and modal extensions to defeasible logics. It can be used as a standalone theory prover and can be embedded into any a...

متن کامل

A Directly Cautious Theory of Defeasible Consequence for Default Logic via the Notion of General Extension

This paper introduces a generalization of Reiter’s notion of “extension” for default logic. The main difference from the original version mainly lies in the way conflicts among defaults are handled: in particular, this notion of “general extension” allows defaults not explicitly triggered to pre-empt other defaults. A consequence of the adoption of such a notion of extension is that the collect...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007